Integer-Digit Functions: An Example of Math-Art Integration
نویسنده
چکیده
M athematics and the visual arts mutually reinforce one another [10]. On the one hand, many mathematical objects appear in artistic or decorative works [5, 6]. In particular, mathematical curves and art have a long-standing connection through the application of geometric principles [13, 20]. Simple curves such as the catenary are ubiquitous, for example in the work of the Catalan architect Antoni Gaudı́, as well as in ancient [19] and in modern architecture [12]. On the other hand, many mathematical objects display artistic appeal per se. The vast list includes, among others: knots [1, 2], mosaics and tiles [3, 21], Fourier series [9], topological tori [15], and fractal curves [4], all of which produce visual patterns of undeniable beauty. Such connections between mathematics and the arts are explored and celebrated annually by the Bridges community formed by mathematicians and artists [8, 18]. This article introduces a new family of curves in the plane defined by functions transforming an integer according to sums of digit-functions. These transforms of an integer N are obtained by multiplying the function value f N ð Þ by the sum of f ai ð Þ, where ai are the digits of N in a given base b and f is a standard function such as a trigonometric, logarithmic, or exponential one. These curves display a few attributes, such as beauty, symmetry, and resemblance to natural environments, which make them attractive for artistic purposes. Digit Sum with ‘‘Memory’’ A nonnegative integer N can be represented in a given base b according to the following expression
منابع مشابه
An efficient extension of the Chebyshev cardinal functions for differential equations with coordinate derivatives of non-integer order
In this study, an effective numerical method for solving fractional differential equations using Chebyshev cardinal functions is presented. The fractional derivative is described in the Caputo sense. An operational matrix of fractional order integration is derived and is utilized to reduce the fractional differential equations to system of algebraic equations. In addition, illustrative examples...
متن کاملOn the rapid computation of various polylogarithmic constants
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log (2...
متن کاملExtension of a class of periodizing variable transformations for numerical Integration
Class Sm variable transformations with integer m, for numerical computation of finite-range integrals, were introduced and studied by the author in the paper [A. Sidi, A new variable transformation for numerical integration, Numerical Integration IV, 1993 (H. Brass and G. Hämmerlin, eds.), pp. 359–373.] A representative of this class is the sinm-transformation that has been used with lattice ru...
متن کاملGeneralized Newman Phenomena and Digit Conjectures on Primes
Recommended by Wee Teck Gan We prove that the ratio of the Newman sum over numbers multiple of a fixed integer, which is not a multiple of 3, and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o1 when the upper limit of summing tends to infinity. We also discuss a connection of our results with a digit conjecture on primes.
متن کاملSafe bounds in linear and mixed-integer linear programming
Current mixed-integer linear programming solvers are based on linear programming routines that use floating-point arithmetic. Occasionally, this leads to wrong solutions, even for problems where all coefficients and all solution components are small integers. An example is given where many state-of-the-art MILP solvers fail. It is then shown how, using directed rounding and interval arithmetic,...
متن کامل